搜索资源列表
Graph
- 创建有向图的邻接表，在此临界表的基础上进行拓扑排序-Create a directed graph adjacency table, the table in this critical topological sort on the basis of
graph
- 有向图 采用邻接表存储 DFS和BFS方法遍历 为方便表示,结点数小于10 用V0-V9表示不同的结点的-Directed graph using adjacency list method of storing DFS and BFS traversal for the convenience that the number of nodes is less than 10 with V0-V9 for different node
NPE
- 本代码实现基于成对约束的半监督图嵌入算法-Following the intuition that the image variation of faces can be effectively modeled by low dimensional linear spaces, we propose a novel linear subspace learning method for face analysis in the framework of graph embeddi
graph
- 图的各种存储结构，特别要熟练掌握邻接矩阵和邻接表存储结构。 遍历是图各种应用的算法的基础，要熟练掌握图的深度优先遍历-Map a variety of storage structures, in particular to master the adjacency matrix and adjacency list storage structure. Graph traversal is a wide range of applications based on algorithms,
graph
- 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS-Adjacency list graph representation of source storage This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS graph adjacency li
graph
- 图的邻接链表及遍历及基本操作，节点的插入删除等基本操作，适合初级算法学习者-Adjacency list graph and traversal and basic operations, insertion node to delete such basic operations, suitable for primary algorithm learners
cycles
- Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency
ShortestPaths
- Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges.
EdgeDisjointCycles
- Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the ed
adjacencyListGragh
- Specification File adjacencyListGragh class GeneralGraph: use adjacency list to implement the graph which data structure is vector Construct methods: * public GeneralGraph(): contain an empty vector store the vertex and a boolean det
1
- 实验1 线性表（1） 输入若干正整数，建立一个顺序表，并在顺序表上实现如下操作：（1）在第3个元素位置插入666。（2）将第8个元素删除。（3）查找值为65的元素，若存在则输出，否则打印没有该元素。 实验2 线性表（2） 输入若干正整数，建立一个带头结点的单链表，并在单链表上实现如下操作：（1）在第3个元素位置插入666。（2）将第8个元素删除。（3）查找值为65的元素，若存在则输出，否则打印没有该元素。（4）查找第3个元素，若存在则输出，否则打印没有该元素。 实验6
Graph
- 依靠链表结构实现的图像(Graph)类抽象数据结构-graph ADT implemented by an Adjacency List structure
create_graphic
- 图的建立，有多种的图可以选择，也可以选择图的遍历方法，里面的图的存储结构是以顶点数组和邻接矩阵的方式存储的。-Map-building, there are several plans to choose, you can choose to graph traversal method, which the storage structure of the plan is based on vertex adjacency matrix of the array and stored the.
c
- 采用邻接矩阵表示法创建有向图，是用c编写的 -Adjacency matrix representation used to create directed graph is prepared with c
graph
- 图： 调试图的邻接链表存储的程序，解决下列问题： 根据教科书P157页的G2图（无向图），输入数据运行程序；再适当修改程序使它适用于G1图（有向图），输入数据运行程序。-Adjacency list graph debug stored procedures, to address the following issues: According to the textbook page G2 Fig P157 (undirected graph), input data to run pro
shortest_path_adjacencyWDigraph
- 采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.
Graphcoloring
- 采取邻接矩阵的搜索算法实现了对图的着色，是一种数值优化算法-Adjacency matrix to a search algorithm for graph coloring, is a numerical optimization algorithm
graph
- 数据结构 有向图的邻接矩阵、度、拓扑算法。无向图的深度优先遍历、广度优先遍历。最小生成树-Adjacency graph data structure to the matrix, the degree of topological algorithms. Undirected graph depth-first traversal, breadth-first traversal. Minimum Spanning Tree
A-topological-sort-of-directed-graph
- 数据结构中的有向图的拓扑排序算法基础程序，可在此基础上进行更改，主要构造了无向图、有向图和逆邻接图，使用c语言编程。-Data structure topological sort algorithm of the directed graph based program that can be changed, on the basis of the main structure undirected graph and directed graph and inverse adjacency
adjacency matrix to represent the graph
- (1)使用邻接矩阵表示图，定义相应的抽象数据类型。 (2)实现两个图ADTs的上述函数。 (3)从空图开始，生成图形对象表示图1所示的图形，将顶点和边逐一插入。 (4)以BFS方式遍历图。((1) Use adjacency matrix to represent graphs and define the corresponding abstract data type. (2) Realize all the above functions for the two graph AD